Embedding a demonic semilattice in a relation algebra
نویسندگان
چکیده
منابع مشابه
Probabilistic Demonic Refinement Algebra
We propose an abstract algebra for reasoning about probabilistic programs in a total-correctness framework. In contrast to probablisitic Kleene algebra it allows genuine reasoning about total correctness and in addition to Kleene star also has a strong iteration operator. We define operators that determine whether a program is enabled, has certain failure or does not have certain failure, respe...
متن کاملOmega Algebra, Demonic Refinement Algebra and Commands
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal operators on the underlying weak semiring, that result directly gives a demonic refinement algebra of commands. This yields models in which extensio...
متن کاملAdjoint Semilattice and Minimal Brouwerian Extensions of a Hilbert Algebra*
Let A := (A,→, 1) be a Hilbert algebra. The monoid of all unary operations on A generated by operations αp : x → (p → x), which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A. This semilattice is isomorphic to the semilattice of finitely generated filters of A, it is subtractive (i.e., dually implicative), and its ideal lattice is isomorph...
متن کاملA Hierarchically Typed Relation Algebra
We consider a typed relation algebra which is used for a calculus of database preferences. So far, the typing mechanism does not cover unions of differently typed elements, which means that the global identity and the greatest element are not typable in the calculus. We suggest a hierarchical type structure to remedy this.
متن کاملKleene Algebra with Tests and Demonic Refinement Algebras
We formalise Kleene algebra with tests (KAT) and demonic refinement algebra (DRA) in Isabelle/HOL. KAT is relevant for program verification and correctness proofs in the partial correctness setting. While DRA targets similar applications in the context of total correctness. Our formalisation contains the two most important models of these algebras: binary relations in the case of KAT and predic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00271-j